Representation of Concurrency with Ordering Matrices
نویسندگان
چکیده
منابع مشابه
Dynamic Detection of Concurrency in Do-loops Using Ordering Matrices Robert
This paper describes the data structures and techniques used in dynamically detecting concurrency in Directly Exccu ted Language (DEL) instruction streams. By dynamic detection, it is meant that these techniques are designed to be used at run time with no special source manipulation or preprocessing required to perform the detection. . An abstract model of a concurrency detection structure call...
متن کاملOrdering Protein Contact Matrices
Numerous biophysical approaches provide information about residues spatial proximity in proteins. However, correct assignment of the protein fold from this proximity information is not straightforward if the spatially close protein residues are not assigned to residues in the primary sequence. Here, we propose an algorithm to assign such residue numbers by ordering the columns and lines of the ...
متن کاملEnhancing scatterplot matrices for data with ordering or spatial attributes
The scatterplot matrix is one of the most common methods used to project multivariate data onto two dimensions for display. While each off-diagonal plot maps a pair of non-identical dimensions, there is no prescribed mapping for the diagonal plots. In this paper, histograms, 1D plots and 2D plots are drawn in the diagonal plots of the scatterplots matrix. In 1D plots, the data are assumed to ha...
متن کاملA Representation of Binary Matrices
In this article we discuss the presentation of a random binary matrix using sequence of whole nonnegative numbers. We examine some advantages and disadvantages of this presentation as an alternative of the standard presentation using two-dimensional array. It is shown that the presentation of binary matrices using ordered n-tuples of natural numbers makes the algorithms faster and saves a lot o...
متن کاملOptimal representation of sparse matrices
This paper introduces a novel data structure used to store sparse matrices optimally – minimizing the space of the matrix representation and the time complexity of an access to the matrix element. The size of our data structure is close to the information theoretic minimum – it differs in the second order term – and permits constant access to the matrix elements and a constant amortized time wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 1973
ISSN: 0018-9340
DOI: 10.1109/tc.1973.5009154